Close

1. Identity statement
Reference TypeConference Paper (Conference Proceedings)
Sitesibgrapi.sid.inpe.br
Holder Codeibi 8JMKD3MGPEW34M/46T9EHH
Identifier6qtX3pFwXQZeBBx/wkA3C
Repositorysid.inpe.br/banon/2002/12.02.12.22
Last Update2002:11.28.02.00.00 (UTC) administrator
Metadata Repositorysid.inpe.br/banon/2002/12.02.12.22.04
Metadata Last Update2022:06.14.00.12.26 (UTC) administrator
DOI10.1109/SIBGRAPI.2001.963058
Citation KeyMatiasOlivGonç:2001:EnVoAp
TitleEnhancing the volumetric approach to stereo matching
Year2001
Access Date2024, May 02
Number of Files1
Size1429 KiB
2. Context
Author1 Matias, Italo de Oliveira
2 Oliveira, Antonio A. F.
3 Gonçalves, Luiz M. G.
EditorBorges, Leandro Díbio
Wu, Shin-Ting
Conference NameBrazilian Symposium on Computer Graphics and Image Processing, 14 (SIBGRAPI)
Conference LocationFlorianópolis, SC, Brazil
Date15-18 Oct. 2001
PublisherIEEE Computer Society
Publisher CityLos Alamitos
Pages218-225
Book TitleProceedings
Tertiary TypeFull Paper
OrganizationSBC - Brazilian Computer Society
History (UTC)2008-07-17 14:10:54 :: administrator -> banon ::
2008-08-26 15:22:03 :: banon -> administrator ::
2009-08-13 20:37:15 :: administrator -> banon ::
2010-08-28 20:00:13 :: banon -> administrator ::
2022-06-14 00:12:26 :: administrator -> :: 2001
3. Content and structure
Is the master or a copy?is the master
Content Stagecompleted
Transferable1
Version Typefinaldraft
Keywordsstereo vision
matching
dynamical programming
AbstractWe propose techniques to enhance the volumetric approach to stereo matching [9, 10, 11], with which to obtain dense disparity and detect occluded zones. The volumetric approach works on the row x column x disparity space initializing the voxels with a measure of the similarity between the stereo pair that they represent (Similarity Phase). In this phase, we propose a function Lo that provides a better initial estimation for disparity. Then, these values are refined through an iterative process which inhibits all but one voxels placed along the same line of sight (Competition Phase).In this phase, we propose to use a Dynamical Programming technique for faster converging to the final solution and producing smoother maps. We substantially reduce the proportionality constant of the original algorithm complexity, enhancing time without strongly influencing the results.
Arrangement 1urlib.net > SDLA > Fonds > SIBGRAPI 2001 > Enhancing the volumetric...
Arrangement 2urlib.net > SDLA > Fonds > Full Index > Enhancing the volumetric...
doc Directory Contentaccess
source Directory Contentthere are no files
agreement Directory Contentthere are no files
4. Conditions of access and use
data URLhttp://urlib.net/ibi/6qtX3pFwXQZeBBx/wkA3C
zipped data URLhttp://urlib.net/zip/6qtX3pFwXQZeBBx/wkA3C
Languageen
Target File218-225.pdf
User Groupadministrator
Visibilityshown
5. Allied materials
Next Higher Units8JMKD3MGPEW34M/46Q6TJ5
8JMKD3MGPEW34M/4742MCS
Citing Item Listsid.inpe.br/sibgrapi/2022/04.29.19.35 8
Host Collectionsid.inpe.br/banon/2001/03.30.15.38
6. Notes
NotesThe conference was held in Florianópolis, SC, Brazil, from October 15 to 18.
Empty Fieldsaffiliation archivingpolicy archivist area callnumber contenttype copyholder copyright creatorhistory descriptionlevel dissemination documentstage e-mailaddress edition electronicmailaddress format group isbn issn label lineage mark mirrorrepository nextedition numberofvolumes orcid parameterlist parentrepositories previousedition previouslowerunit progress project readergroup readpermission resumeid rightsholder schedulinginformation secondarydate secondarykey secondarymark secondarytype serieseditor session shorttitle sponsor subject tertiarymark type url volume


Close